Maximal sets of ambiguous points

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some results on maximal open sets

In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.

متن کامل

Fixed points and maximal independent sets in AND-OR networks

We study the maximum number of 2xed points of boolean networks with local update function AND–OR. We prove that this number for networks with connected digraph is 2(n−1)=2 for n odd and 2(n−2)=2 + 1 for n even if the digraph has not loops; and 2n−1 + 1 otherwise, where n is the number of nodes of the digraph. We also exhibit some networks reaching these bounds. To obtain these results we constr...

متن کامل

Ambiguous Tipping Points∗

We analyze the policy implications of aversion to Knightian uncertainty (or ambiguity) about the possibility of tipping points. We demonstrate two channels through which uncertainty aversion affects optimal policy in the general setting. The first channel relates to the policy’s effect on the probability of tipping, and the second channel to its differential impact in the preand post-tipping re...

متن کامل

Some points on generalized open sets

The paper is an attempt to represent a study of limit points, boundary points, exterior points, border, interior points and closure points in the common generalized topological space. This paper takes a look at the possibilities of an extended topological space and it also considers the new characterizations of dense set.

متن کامل

Maximal Sets of Factors

In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These factors at times satisfy additional structural constraints, such as being connected, or such as requiring each component of each factor to be isomorphic. Each set of factors occurs in some natural family of graphs, including complete graphs and complete multipartite graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tohoku Mathematical Journal

سال: 1972

ISSN: 0040-8735

DOI: 10.2748/tmj/1178241488